Higher response time moments for M/M/1 discriminatory processor sharing queues

نویسندگان

  • Tiberiu S. Chis
  • Peter G. Harrison
چکیده

Obtaining response time moments in processor sharing (PS) queues is difficult due to serving of multiple jobs. Egaliatarian PS (EPS) queues are limited to one class of arriving jobs. Discriminatory PS (DPS) assigns weights to different job classes and offers more diverse modeling capabilities than EPS. It is known that response time is the representative metric for delay as specified in service level agreements (SLAs), which consider higher moments important. Hence, we build an automated numerical algorithm for calculating higher moments of response time in M/M/1-DPS queues for multiple job classes and test two different case studies. CCS Concepts •Mathematics of computing→Queueing theory; Numerical analysis; •Networks→ Network performance evaluation;

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Moment-Generating Algorithm for Response Time in Processor Sharing Queueing Systems

Response times are arguably the most representative and important metric for measuring the performance of modern computer systems. Further, service level agreements (SLAs), ranging from data centres to smartphone users, demand quick and, equally important, predictable response times. Hence, it is necessary to calculate moments, at least, and ideally response time distributions, which is not str...

متن کامل

A Unifying Conservation Law for Single-server Queues

We develop a conservation law for a multi-class GI/GI/1 queue operating under a general work-conserving scheduling discipline. For single-class single-server queues, conservation laws have been obtained for both nonanticipating and anticipating disciplines with general service time distributions. For multi-class single-server queues, conservation laws have been obtained for (i) nonanticipating ...

متن کامل

A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues

We compare the overall mean response time (a.k.a. sojourn time) of the processor sharing (PS) and feedback (FB) queues under an M/GI/1 system. We show that FB outperforms PS under service distributions having decreasing failure rates; whereas PS outperforms FB under service distributions having increasing failure rates. c © 2003 Elsevier B.V. All rights reserved.

متن کامل

Explicit Formulas for the Moments of the Sojourn Time in the M/g/1 Processor Sharing Queue with Permanent Jobs

We give some representation about recent achievements in analysis of the M/G/1 queue with egalitarian processor sharing discipline (EPS). The new formulas are derived for the j-th moments (j ∈ N) of the (conditional) stationary sojourn time in the M/G/1—EPS queue with K (K ∈ 0 ∪ N) permanent jobs of infinite size. We discuss also how to simplify the computations of the moments.

متن کامل

Tail Asymptotics for Processor Sharing Queues

The basic queueing system considered in this paper is the M/G/1 processor sharing (PS) queue with or without impatience and with finite or infinite capacity. Under some mild assumptions, a criterion for the validity of the RSR (Reduced Service Rate) approximation is established when service times are heavy tailed. This result is applied to various models based on M/G/1 processor sharing queues.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • EAI Endorsed Trans. Scalable Information Systems

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2016